Covering and Packing with Spheres
نویسنده
چکیده
We address the problem of covering R with congruent balls, while minimizing the number of balls that contain an average point. Considering the 1-parameter family of lattices defined by stretching or compressing the integer grid in diagonal direction, we give a closed formula for the covering density that depends on the distortion parameter. We observe that our family contains the thinnest lattice coverings in dimensions 2 to 5. We also consider the problem of packing congruent balls in R, for which we give a closed formula for the packing density as well. Again we observe that our family contains optimal configurations, this time densest packings in dimensions 2 and 3.
منابع مشابه
Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels
Many of the classic problem of coding theory are highly symmetric, which makes it easy to derive spherepacking upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and sphere-covering bounds to arbitrary error models. These generalizations become especially important when the sizes of the error spheres are nonuniform. The best poss...
متن کاملShelling Tumors with Caution and Wiggles
We discuss a simple model for tumor growth, which results in realistic tumor shapes. We then address the question of efficient irradiation of tumors in terms of packing their volume with disjoint spheres of given radii. We develop three algorithms, based on a shelling method, which give recommendations for optimal sphere packings. These packings are interpreted as treatment plans, and the corre...
متن کاملLog-Normal and Mono-Sized Particles’ Packing into a Bounded Region
Many systems can be modeled with hard and various size spheres, therefore packing and geometrical structures of such sets are of great importance. In this paper, rigid spherical particles distributed in different sizes are randomly packed in confined spaces, using a parallel algorithm. Mersenne Twister algorithm was used to generate pseudorandom numbers for initial coordination of particles. Di...
متن کامل2 1 Ja n 19 97 Circles , Spheres and Drops Packings
We studied the geometrical and topological rules underlying the dispositions and the size distribution of non– overlapping, polydisperse circle–packings. We found that the size distribution of circles that densely cover a plane follows the power law: N(R) ∝ R. We obtained an approximate expression which relates the exponent α to the average coordination number and to the packing strategy. In th...
متن کاملTetrahedral colloidal clusters from random parking of bidisperse spheres.
Using experiments and simulations, we investigate the clusters that form when colloidal spheres stick irreversibly to--or "park" on--smaller spheres. We use either oppositely charged particles or particles labeled with complementary DNA sequences, and we vary the ratio α of large to small sphere radii. Once bound, the large spheres cannot rearrange, and thus the clusters do not form dense or sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010